On the Decidability of Checking Problems for CCS with Static μ-Operator
نویسندگان
چکیده
The paper considers the strong bisimilarity/similarity checking problems for CCS and CCS, two typical variants of CCS. The strong bisimilarity of the CCS/CCS processes is shown to be Π 1 -complete, even when the processes are restricted to the restriction prenex normal forms. The strong bisimilarity between a CCS/CCS process and a fixed regular process is also shown to be Π 1 -complete. The paper also establishes the decidability of the similarity problem of a regular process by a CCS process.
منابع مشابه
Decidability of Behavioural Equivalences in Process Calculi with Name Scoping
Local channels and their name scoping rules play a significant role in the study of the expressiveness of process calculi. The paper contributes to the understanding of the expressiveness in the context of CCS by studying the decidability issues of the bisimilarity/similarity checking problems. The strong bisimilarity for a pair of processes in the calculi with only static local channels is sho...
متن کاملDecidability of Behavioral Equivalences in Process Calculi with Name Scoping
Local channels and their name scoping rules play a significant role in the study of the expressiveness of process calculi. The paper contributes to the understanding of the expressiveness in the context of CCS by studying the decidability issues of the bisimilarity/similarity checking problems. The strong bisimilarity for a pair of processes in the calculi with only static local channels is sho...
متن کاملDecidability and Undecidability Results of Modal μ-calculi with N1 Semantics
In our previous study, we defined the semantics of modal μ-calculus on minplus algebra N∞ and developed a model-checking algorithm. N∞ is the set of all natural numbers and infinity (∞), and has two operations min and plus. In the semantics, disjunctions are interpreted by min and conjunctions by plus. This semantics allows interesting properties of a Kripke structure, such as the shortest path...
متن کاملModel Checking Succinct and Parametric One-Counter Automata
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which additive updates are encoded in binary, as well as parametric one-counter automata, in which additive updates may be given as unspecified parameters. We fully determine the complexity of model checking these automata ...
متن کاملThe Decidability of the Reachability Problem for CCS!
CCS is a variant of CCS in which infinite behaviours are defined by the replication operator. We show that the reachability problem for CCS is decidable by a reduction to the same problem for Petri Nets.
متن کامل